Interior eigensolver for sparse Hermitian definite matrices based on Zolotarev’s functions
نویسندگان
چکیده
This paper proposes an efficient method for computing selected generalized eigenpairs of a sparse Hermitian definite matrix pencil $(A,B)$. Based on Zolotarev's best rational function approximations the signum and conformal mapping techniques, we construct approximation rectangular supported arbitrary interval via compositions with partial fraction representations. new can be applied to spectrum filters $(A,B)$ smaller number poles than direct construction without compositions. Combining fast solvers shift-invariant minimal residual method, hybrid algorithm is proposed apply spectral efficiently. Compared state-of-the-art FEAST, more when factorizations are required solve multi-shift linear systems in eigensolver, since needed our method. The efficiency stability demonstrated by numerical examples from computational chemistry.
منابع مشابه
Spectrum Slicing for Sparse Hermitian Definite Matrices Based on Zolotarev's Functions
This paper proposes an efficient method for computing selected generalized eigenpairs of a sparse Hermitian definite matrix pencil (A,B). Based on Zolotarev’s best rational function approximations of the signum function and conformal mapping techniques, we construct the best rational function approximation of a rectangular function supported on an arbitrary interval. This new best rational func...
متن کاملA Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
We present a fast contour-integral eigensolver for finding selected or all the eigenpairs of a non-Hermitian matrix based on a series of analytical and computational techniques, such as the analysis of filter functions, quick and reliable eigenvalue count via low-accuracy matrix approximations, and fast shifted factorization update. The quality of some quadrature rules for approximating a relev...
متن کاملOn SSOR-like preconditioners for non-Hermitian positive definite matrices
We construct, analyze and implement SSOR-like preconditioners for non-Hermitian positive definite system of linear equations when its coefficient matrix possesses either a dominant Hermitian part or a dominant skew-Hermitian part. We derive tight bounds for eigenvalues of the preconditioned matrices and obtain convergence rates of the corresponding SSOR-like iteration methods as well as the cor...
متن کاملOn Adaptive Weighted Polynomial Preconditioning for Hermitian Positive Definite Matrices
The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bou...
متن کاملStrictly Hermitian Positive Definite Functions
Let H be any complex inner product space with inner product < ·, · >. We say that f : | C → | C is Hermitian positive definite on H if the matrix ( f(< z,z >) )n r,s=1 (∗) is Hermitian positive definite for all choice of z, . . . ,z in H, all n. It is strictly Hermitian positive definite if the matrix (∗) is also non-singular for any choice of distinct z, . . . ,z in H. In this article we prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2021
ISSN: ['1539-6746', '1945-0796']
DOI: https://doi.org/10.4310/cms.2021.v19.n4.a11